Order-by-disorder in classical oscillator systems

We consider classical nonlinear oscillators on hexagonal lattices. When the coupling between the elements is repulsive, we observe coexisting states, each one with its own basin of attraction. These states differ by their degree of synchronization and by patterns of phase-locked motion. When disorder is introduced into the system by additive or multiplicative Gaussian noise, we observe a non-monotonic dependence of the degree of order in the system as a function of the noise intensity: intervals of noise intensity with low synchronization between the oscillators alternate with intervals where more oscillators are synchronized. In the latter case, noise induces a higher degree of order in the sense of a larger number of nearly coinciding phases. This order-by-disorder effect is reminiscent to the analogous phenomenon known from spin systems. Surprisingly, this non-monotonic evolution of the degree of order is found not only for a single interval of intermediate noise strength, but repeatedly as a function of increasing noise intensity. We observe noise-driven migration of oscillator phases in a rough potential landscape.Comment: 12 pages, 13 figures; comments are welcom

Sierpinski signal generates 1/fα1/f^\alpha spectra

We investigate the row sum of the binary pattern generated by the Sierpinski automaton: Interpreted as a time series we calculate the power spectrum of this Sierpinski signal analytically and obtain a unique rugged fine structure with underlying power law decay with an exponent of approximately 1.15. Despite the simplicity of the model, it can serve as a model for $1/f^\alpha$ spectra in a certain class of experimental and natural systems like catalytic reactions and mollusc patterns.Comment: 4 pages (4 figs included). Accepted for publication in Physical Review

Online regenerator placement.

Connections between nodes in optical networks are realized by lightpaths. Due to the decay of the signal, a regenerator has to be placed on every lightpath after at most d hops, for some given positive integer d. A regenerator can serve only one lightpath. The placement of regenerators has become an active area of research during recent years, and various optimization problems have been studied. The first such problem is the Regeneration Location Problem (Rlp), where the goal is to place the regenerators so as to minimize the total number of nodes containing them. We consider two extreme cases of online Rlp regarding the value of d and the number k of regenerators that can be used in any single node. (1) d is arbitrary and k unbounded. In this case a feasible solution always exists. We show an O(log|X| ·logd)-competitive randomized algorithm for any network topology, where X is the set of paths of length d. The algorithm can be made deterministic in some cases. We show a deterministic lower bound of W([(log(|E|/d) ·logd)/(log(log(|E|/d) ·logd))])log(Ed)logdlog(log(Ed)logd) , where E is the edge set. (2) d = 2 and k = 1. In this case there is not necessarily a solution for a given input. We distinguish between feasible inputs (for which there is a solution) and infeasible ones. In the latter case, the objective is to satisfy the maximum number of lightpaths. For a path topology we show a lower bound of Öl/2l2 for the competitive ratio (where l is the number of internal nodes of the longest lightpath) on infeasible inputs, and a tight bound of 3 for the competitive ratio on feasible inputs

Electromagnetic Oscillations in a Driven Nonlinear Resonator: A New Description of Complex Nonlinear Dynamics

Many intriguing properties of driven nonlinear resonators, including the appearance of chaos, are very important for understanding the universal features of nonlinear dynamical systems and can have great practical significance. We consider a cylindrical cavity resonator driven by an alternating voltage and filled with a nonlinear nondispersive medium. It is assumed that the medium lacks a center of inversion and the dependence of the electric displacement on the electric field can be approximated by an exponential function. We show that the Maxwell equations are integrated exactly in this case and the field components in the cavity are represented in terms of implicit functions of special form. The driven electromagnetic oscillations in the cavity are found to display very interesting temporal behavior and their Fourier spectra contain singular continuous components. To the best of our knowledge, this is the first demonstration of the existence of a singular continuous (fractal) spectrum in an exactly integrable system.Comment: 5 pages, 3 figure

Steady Stokes flow with long-range correlations, fractal Fourier spectrum, and anomalous transport

We consider viscous two-dimensional steady flows of incompressible fluids past doubly periodic arrays of solid obstacles. In a class of such flows, the autocorrelations for the Lagrangian observables decay in accordance with the power law, and the Fourier spectrum is neither discrete nor absolutely continuous. We demonstrate that spreading of the droplet of tracers in such flows is anomalously fast. Since the flow is equivalent to the integrable Hamiltonian system with 1 degree of freedom, this provides an example of integrable dynamics with long-range correlations, fractal power spectrum, and anomalous transport properties.Comment: 4 pages, 4 figures, published in Physical Review Letter

Hysteresis of dynamos in rotating spherical shell convection

Bifurcations of dynamos in rotating and buoyancy-driven spherical Rayleigh-Bénard convection in an electrically conducting fluid are investigated numerically. Both nonmagnetic and magnetic solution branches comprised of rotating waves are traced by path-following techniques, and their bifurcations and interconnections for different Ekman numbers are determined. In particular, the question of whether the dynamo branches bifurcate super- or subcritically and whether a direct link to the primary pure convective states exists is answered

Hysteresis of dynamos in rotating spherical shell convection

Bifurcations of dynamos in rotating and buoyancy-driven spherical Rayleigh-Bénard convection in an electrically conducting fluid are investigated numerically. Both nonmagnetic and magnetic solution branches comprised of rotating waves are traced by path-following techniques, and their bifurcations and interconnections for different Ekman numbers are determined. In particular, the question of whether the dynamo branches bifurcate super- or subcritically and whether a direct link to the primary pure convective states exists is answered

Online regenerator placement

Connections between nodes in optical networks are realized by lightpaths. Due to the decay of the signal, a regenerator has to be placed on every lightpath after at most d hops, for some given positive integer d. A regenerator can serve only one lightpath. The placement of regenerators has become an active area of research during recent years, and various optimization problems have been studied. The first such problem is the Regeneration Location Problem (Rlp), where the goal is to place the regenerators so as to minimize the total number of nodes containing them. We consider two extreme cases of online Rlp regarding the value of d and the number k of regenerators that can be used in any single node. (1) d is arbitrary and k unbounded. In this case a feasible solution always exists. We show an O(log|X|⋅ logd)-competitive randomized algorithm for any network topology, where X is the set of paths of length d. The algorithm can be made deterministic in some cases. We show a deterministic lower bound of Ω( log(|E|/d)⋅logd log(log(|E|/d)⋅logd) ), where E is the edge set. (2) d = 2 and k = 1. In this case there is not necessarily a solution for a given input. We distinguish between feasible inputs (for which there is a solution) and infeasible ones. In the latter case, the objective is to satisfy the maximum number of lightpaths. For a path topology we show a lower bound of √ l /2 for the competitive ratio (where l is the number of internal nodes of the longest lightpath) on infeasible inputs, and a tight bound of 3 for the competitive ratio on feasible inputs